SDP-based approximation of stabilising solutions for periodic matrix Riccati differential equations

Numerically finding stabilising feedback control laws for linear systems of periodic differential equations is a nontrivial task with no known reliable solutions. The most successful method requires solving matrix differential Riccati equations with periodic coefficients. All previously proposed techniques for solving such equations involve numerical integration of unstable differential equations and consequently fail whenever the period is too large or the coefficients vary too much. Here, a new method for numerical computation of stabilising solutions for matrix differential Riccati equations with periodic coefficients is proposed. Our approach does not involve numerical solution of any differential equations. The approximation for a stabilising solution is found in the form of a trigonometric polynomial, matrix coefficients of which are found solving a specially constructed finite-dimensional semidefinite programming (SDP) problem. This problem is obtained using maximality property of the stabilising solution of the Riccati equation for the associated Riccati inequality and sampling technique. Our previously published numerical comparisons with other methods shows that for a class of problems only this technique provides a working solution. Asymptotic convergence of the computed approximations to the stabilising solution is proved below under the assumption that certain combinations of the key parameters are sufficiently large. Although the rate of convergence is not analysed, it appeared to be exponential in our numerical studies.     

State synchronization of linear and nonlinear agents in time‐varying networks

This paper studies state synchronization of homogeneous time‐varying networks with diffusive full‐state coupling or partial‐state coupling. In the case of full‐state coupling, linear agents as well as a class of nonlinear time‐varying agents are considered. In the case of partial‐state coupling, we only consider linear agents, but, in contrast with the literature, we do not require the agents in the network to be minimum phase or at most weakly unstable. In both cases, the network is time‐varying in the sense that the network graph switches within an infinite set of graphs with arbitrarily small dwell time. A purely decentralized linear static protocol is designed for agents in the network with full‐state coupling. For partial‐state coupling, a linear dynamic protocol is designed for agents in the network while using additional communication among controller variables using the same network. In both cases, the design is based on a high‐gain methodology. Copyright © 2017 John Wiley & Sons, Ltd.     

Homotopy-based surface reconstruction with application to?acoustic signals

This work introduces a new algorithm for surface reconstruction in ℝ³ from spatially arranged one-dimensional cross sections embedded in ℝ³. This is generally the case with acoustic signals that pierce an object non-destructively. Continuous deformations (homotopies) that smoothly reconstruct information between any pair of successive cross sections are derived. The zero level set of the resulting homotopy field generates the desired surface. Four types of homotopies are suggested that are well suited to generate a smooth surface. We also provide derivation of necessary higher order homotopies that can generate a C ² surface. An algorithm to generate surface from acoustic sonar signals is presented with results. Reconstruction accuracies of the homotopies are compared by means of simulations performed on basic geometric primitives.     

Inverse filtering and deconvolution

This paper studies the so‐called inverse filtering and deconvolution problem from different angles. To start with, both exact and almost deconvolution problems are formulated, and the necessary and sufficient conditions for their solvability are investigated. Exact and almost deconvolution problems seek filters that can estimate the unknown inputs of the given plant or system either exactly or almostly whatever may be the unintended or disturbance inputs such as measurement noise, external disturbances, and model uncertainties that act on the system. As such they require strong solvability conditions. To alleviate this, several optimal and suboptimal deconvolution problems are formulated and studied. These problems seek filters that can estimate the unknown inputs of the given system either exactly, almostly or optimally in the absence of unintended (disturbance) inputs, and on the other hand, in the presence of unintended (disturbance) inputs, they seek that the influence of such disturbances on the estimation error be as small as possible in a certain norm (H₂ or H_∞) sense. Both continuous‐ and discrete‐time systems are considered. For discrete‐time systems, the counter parts of all the above problems when an ??‐step delay in estimation is present are introduced and studied. Next, we focus on the exact and almost deconvolution but this time when the uncertainties in plant dynamics can be structurally modeled by a Δ‐block as a feedback element to the nominally known plant dynamics. This is done either in the presence or absence of external disturbances. Copyright © 2001 John Wiley & Sons, Ltd.     

On complexity of optimal recombination for binary representations of solutions

We consider the optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The optimal recombination is studied in the case where a vector of binary variables is used as a solution encoding. By means of efficient reductions of the optimal recombination problems (ORPs) we show the polynomial solvability of the ORPs for the maximum weight set packing problem, the minimum weight set partition problem, and for linear Boolean programming problems with at most two variables per inequality, and some other problems. We also identify several NP-hard cases of optimal recombination: the Boolean linear programming problems with three variables per inequality, the knapsack, the set covering, the p-median, and some other problems.     

Meetings and meeting modeling in smart environments

In this paper we survey our research on smart meeting rooms and its relevance for augmented reality meeting support and virtual reality generation of meetings in real time or off-line. The research reported here forms part of the European 5th and 6th framework programme projects multi-modal meeting manager (M4) and augmented multi-party interaction (AMI). Both projects aim at building a smart meeting environment that is able to collect multimodal captures of the activities and discussions in a meeting room, with the aim to use this information as input to tools that allow real-time support, browsing, retrieval and summarization of meetings. Our aim is to research (semantic) representations of what takes place during meetings in order to allow generation, e.g. in virtual reality, of meeting activities (discussions, presentations, voting, etc.). Being able to do so also allows us to look at tools that provide support during a meeting and at tools that allow those not able to be physically present during a meeting to take part in a virtual way. This may lead to situations where the differences between real meeting participants, human-controlled virtual participants and (semi-) autonomous virtual participants disappear.

A rapid method of oxymyoglobin purification

Oxymyoglobin was isolated from bovine Longissimus lumborum muscle by precipitation with ammonium sulfate and purification in rapid conditions with only one chromatographic step on Mono-Q HR column with a HPLC system. Purity of oxymyoglobin was controlled by SDS-polyacrylamide gel electrophoresis and isoelectrofocusing.     

Simultaneous external and internal stabilization of linear systems with input saturation and non-input-additive sustained disturbances

In this paper, we study simultaneous external and internal stabilization of the linear system under input saturation and non-input additive sustained disturbances. For systems that are asymptotic null controllable with bounded control, it is shown that a nonlinear dynamic feedback controller can be designed so that the closed-loop states remain bounded for any initial condition and for two classes of sustained disturbances, and that the equilibrium in the absence of disturbances is globally asymptotically stable.     

Thermochemische Kennwerte für die Reaktion,Mo + O2 ⇌ MoO2 sowie in Eisenschmelzen

Zusammenstellung von Schrifttumsangaben für die Änderung der freien Standardenthalpien der Reaktionen , Mo + O₂ ? MoO₂ und in Eisenschmelzen. Neubestimmung der Temperaturabhängigkeiten der Größen ΔG^oCr₂O₃, ΔG^oMoO₂ und ΔG^o_O im Eisen bei Temperaturen zwischen 1460 bzw. 1530 und 1725 °C. Nachweis der Anwendbarkeit der neu ermittelten thermodynamischen Funktionen durch EMK-Parallelmessungen an ThO₂ (Y₂O₃)- und ZrO₂ (MgO)-Festelektrolytzellen mit Cr-Cr₂O₃- und Mo-MoO₂-Referenzelektroden in Reineisenschmelzen bei 1600 °C. Ermittlung des Parameters p_e′ der Elektronenteilleitfähigkeit für einen teilstabilisierten ZrO₂-Festelektrolyten mit einem Stoffmengengehalt von 5% MgO.     

On the convergence of stationary sequences in topology optimization

We consider structural topology optimization problems including unilateral constraints arising from non‐penetration conditions in contact mechanics. The resulting non‐convex non‐smooth problems are instances of mathematical programs with equilibrium constraints (MPEC), or bi‐level programs. Applying nested (implicit programming) algorithms to this class of problems is problematic owing to the singularity of the feasible set. We propose a perturbation strategy combining the relaxation of the equilibrium constraint with the restriction of the design domain to its regular part only. This strategy allows us to attack the problem numerically using standard non‐linear programming algorithms. We rigorously study the optimality conditions for the original singular problem as well as the convergence of stationary points and globally optimal solutions to approximating problems towards respective stationary points and globally optimal solutions to the original problem. A limited numerical benchmarking of the algorithm is performed. Copyright © 2005 John Wiley & Sons, Ltd.